Wave Sort Algorithm
Wave Sort is a novel sorting algorithm designed to sort an array by creating a wave-like pattern. The algorithm divides the array into two halves recursively, sorts each half, and then merges them in a way that alternates between larger and smaller elements, creating a wave-like structure.

How It Works:
Divide: The array is recursively divided into two halves.
Sort: Each half is sorted individually.
Wave Shuffle: The sorted halves are then merged in a wave pattern by alternating elements from the left and right halves.
Wave Merge: The algorithm ensures that the final array follows a wave pattern where each element alternates between being greater and less than its neighboring elements.
Final Sorting Pass: A final insertion sort pass ensures that the wave structure is maintained while sorting the array.
Time Complexity:
The worst-case time complexity of the Wave Sort algorithm is 𝑂(𝑛2)

However, due to the wave merging process, the algorithm can perform better on nearly sorted arrays.
Space Complexity:
The space complexity is 𝑂(𝑛)
O(n) due to the additional space required for the auxiliary array and the recursion stack.
Applications:
Wave Sort can be useful in scenarios where a specific wave-like pattern is desired in the sorted data, such as in certain data visualizations or specialized sorting tasks.